Families of p-ary sequences with low correlation and large linear complexity
نویسندگان
چکیده
This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملNew construction of M -ary sequence families with low correlation from the structure of Sidelnikov sequences
The main topics of this paper are the structure of Sidelnikov sequences and new construction of M ary sequence families from the structure. For prime p and a positive integer m, it is shown that M -ary Sidelnikov sequences of period p − 1, if M | pm − 1, can be equivalently generated by the operation of elements in a finite field GF(p), including a p-ary m-sequence. The equivalent representatio...
متن کاملNew designs for signal sets with low cross correlation, balance property, and largelinear span: GF(p) case
New designs for families of sequences over GF ( ) with low cross correlation, balance property, and large linear span are presented. The key idea of the new designs is to use short -ary sequences of period with the two-level autocorrelation function together with the interleaved structure to construct a set of long sequences with the desired properties. The resulting sequences are interleaved s...
متن کاملImproved p-ary Codes and Sequence Families from Galois Rings
This paper explores the applications of a recent bound on some Weil-type exponential sums over Galois rings in the construction of codes and sequences. A family of codes over Fp, mostly nonlinear, of length pm+1 and size p2 ·pm(D− D/p ), where 1 ≤ D ≤ pm/2, is obtained. The bound on this type of exponential sums provides a lower bound for the minimum distance of these codes. Several families of...
متن کاملNew Families of p-Ary Sequences of Period $ rac{p^n-1}{2}$ with Low Maximum Correlation Magnitude
Let p be an odd prime such that p ≡ 3 mod 4 and n be an odd integer. In this paper, two new families of p-ary sequences of period N = p −1 2 are constructed by two decimated p-ary m-sequences m(2t) and m(dt), where d = 4 and d = (p +1)/2 = N +1. The upper bound on the magnitude of correlation values of two sequences in the family is derived using Weil bound. Their upper bound is derived as 3 √ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Systems Science & Complexity
دوره 27 شماره
صفحات -
تاریخ انتشار 2014